Partial Order Semantics of Types of Nets
نویسندگان
چکیده
In this paper we define partial order semantics of types of nets. Types of nets are a parametric definition of Petri nets originally developed for a general presentation of the synthesis of Petri nets from (step) transition systems. Partial order semantics of a concrete net (of a certain type) usually are given by the set of labelled partial orders (LPOs) enabled w.r.t. the net. For classical place/transition nets there are several equivalent characterizations of enabled LPOs. We discuss in which way the general notion of types of nets has to be restricted such that these characterizations can also be formulated for nets of such type. In particular we consider under which requirements enabled LPOs can be defined through token flows, which have been proven to be useful for efficient synthesis and verification of Petri nets. The presented concepts form the basis for a general presentation of the synthesis of Petri nets from sets of LPOs.
منابع مشابه
Causality in Extensions of Petri Nets
The causal semantics of standard net classes like Elementary Net Systems and Place/Transition Nets, is typically expressed in terms of partially ordered sets of transition occurrences. In each such partial order, causally related occurrences are ordered while concurrent transition occurrences remain unordered. Partial order semantics can, in particular, support model checking by efficient verif...
متن کاملBack in Time Petri Nets
The time progress assumption is at the core of the semantics of real-time formalisms. It is also the major obstacle to the development of partial-order techniques for real-time distributed systems since the events are ordered both by causality and by their occurrence in time. Anyway, extended free choice safe time Petri nets (TPNs) were already identified as a class where partial order semantic...
متن کاملPartial Order Semantics and Read Arcs
We study a new partial order semantics of Petri nets with read arcs, where read arcs model reading without consuming, which is often more adequate than the destructive-read-and-rewrite modelled in ordinary nets. As basic observations we take ST-traces, which are sequences of transition starts and ends. We deene processes of our nets and derive two partial orders modelling causality and start pr...
متن کاملProcess Semantics of Petri Nets over Partial Algebra
“Petri nets are monoids” is the title and the central idea of the paper [7]. It provides an algebraic approach to define both nets and their processes as terms. A crucial assumption for this concept is that arbitrary concurrent composition of processes is defined, which holds true for place/transition Petri nets where places can hold arbitrarily many tokens. This paper defines a similar concept...
متن کاملComplete Finite Prefixes of Symbolic Unfoldings of Safe Time Petri Nets
Time Petri nets have proved their interest in modeling realtime concurrent systems. Their usual semantics is defined in term of firing sequences, which can be coded in a (symbolic and global) state graph, computable from a bounded net. An alternative is to consider a “partial order” semantics given in term of processes, which keep explicit the notions of causality and concurrency without comput...
متن کامل